TSTP Solution File: NUM802^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM802^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:58:02 EDT 2024
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 16 ( 6 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 65 ( 12 ~; 4 |; 4 &; 39 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 1 ^ 13 !; 2 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
c_2: $i ).
thf(decl_23,type,
absval: $i > $i ).
thf(decl_24,type,
c0: $i ).
thf(decl_25,type,
c_less_: $i > $i > $o ).
thf(decl_26,type,
esk1_1: ( $i > $o ) > $i ).
thf(cBLEDSOE_FENG_8,conjecture,
( ( c_less_ @ c_2 @ c0 )
=> ( ! [X1: $i,X2: $i] :
( ( c_less_ @ X1 @ c0 )
=> ( X1
!= ( absval @ X2 ) ) )
=> ? [X3: $i > $o] :
( ! [X4: $i] :
~ ( X3 @ ( absval @ X4 ) )
& ( X3 @ c_2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6zocC6CJu4/E---3.1_18638.p',cBLEDSOE_FENG_8) ).
thf(c_0_1,negated_conjecture,
~ ( ( c_less_ @ c_2 @ c0 )
=> ( ! [X1: $i,X2: $i] :
( ( c_less_ @ X1 @ c0 )
=> ( X1
!= ( absval @ X2 ) ) )
=> ? [X3: $i > $o] :
( ! [X4: $i] :
~ ( X3 @ ( absval @ X4 ) )
& ( X3 @ c_2 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBLEDSOE_FENG_8])]) ).
thf(c_0_2,negated_conjecture,
! [X9: $i,X10: $i,X11: $i > $o] :
( ( c_less_ @ c_2 @ c0 )
& ( ~ ( c_less_ @ X9 @ c0 )
| ( X9
!= ( absval @ X10 ) ) )
& ( ( X11 @ ( absval @ ( esk1_1 @ X11 ) ) )
| ~ ( X11 @ c_2 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( c_less_ @ X1 @ c0 )
| ( X1
!= ( absval @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: $i > $o] :
( ( X3 @ ( absval @ ( esk1_1 @ X3 ) ) )
| ~ ( X3 @ c_2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i] :
~ ( c_less_ @ ( absval @ X1 ) @ c0 ),
inference(er,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( absval
@ ( esk1_1
@ ^ [Z0: $i] : ( Z0 = c_2 ) ) )
= c_2 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_4]) ).
thf(c_0_7,negated_conjecture,
c_less_ @ c_2 @ c0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : NUM802^5 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n031.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 09:48:16 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running higher-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.6zocC6CJu4/E---3.1_18638.p
% 0.15/0.41 # Version: 3.1.0-ho
% 0.15/0.41 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.15/0.41 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting post_as_ho12 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_9 with 300s (1) cores
% 0.15/0.41 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.41 # Starting post_as_ho4 with 300s (1) cores
% 0.15/0.41 # Starting post_as_ho2 with 300s (1) cores
% 0.15/0.41 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.15/0.41 # Starting full_lambda_10 with 300s (1) cores
% 0.15/0.41 # Starting new_ho_8 with 300s (1) cores
% 0.15/0.41 # new_bool_9 with pid 18718 completed with status 0
% 0.15/0.41 # Result found by new_bool_9
% 0.15/0.41 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.15/0.41 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting post_as_ho12 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_9 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.15/0.41 # Search class: HHHSF-FFSF11-SSSFFSBN
% 0.15/0.41 # partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.15/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.15/0.41 # ehoh_best2_full_lfho with pid 18725 completed with status 0
% 0.15/0.41 # Result found by ehoh_best2_full_lfho
% 0.15/0.41 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.15/0.41 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting post_as_ho12 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_9 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.15/0.41 # Search class: HHHSF-FFSF11-SSSFFSBN
% 0.15/0.41 # partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.15/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Theorem
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 5
% 0.15/0.42 # Removed by relevancy pruning/SinE : 4
% 0.15/0.42 # Initial clauses : 3
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 3
% 0.15/0.42 # Processed clauses : 5
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 0
% 0.15/0.42 # ...remaining for further processing : 5
% 0.15/0.42 # Other redundant clauses eliminated : 1
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 0
% 0.15/0.42 # Generated clauses : 10
% 0.15/0.42 # ...of the previous two non-redundant : 6
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 2
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 1
% 0.15/0.42 # Disequality decompositions : 0
% 0.15/0.42 # Total rewrite steps : 1
% 0.15/0.42 # ...of those cached : 0
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 4
% 0.15/0.42 # Positive orientable unit clauses : 2
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 1
% 0.15/0.42 # Non-unit-clauses : 1
% 0.15/0.42 # Current number of unprocessed clauses: 4
% 0.15/0.42 # ...number of literals in the above : 8
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 0
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.42 # Non-unit clause-clause subsumptions : 0
% 0.15/0.42 # Unit Clause-clause subsumption calls : 0
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 0
% 0.15/0.42 # BW rewrite match successes : 0
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 468
% 0.15/0.42 # Search garbage collected termcells : 114
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.003 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.004 s
% 0.15/0.42 # Maximum resident set size: 1780 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.004 s
% 0.15/0.42 # System time : 0.003 s
% 0.15/0.42 # Total time : 0.007 s
% 0.15/0.42 # Maximum resident set size: 1700 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.42 % E exiting
%------------------------------------------------------------------------------